Parallelism and Concurrency in Adhesive High-Level Replacement Systems with Negative Application Conditions

نویسندگان

  • Leen Lambers
  • Hartmut Ehrig
  • Ulrike Golas
  • Fernando Orejas
چکیده

The goal of this paper is the generalization of parallelism and concurrency results for adhesive High-Level Replacement (HLR) systems to adhesive HLR systems with negative application conditions. These conditions restrict the application of a rule by expressing that a specific structure should not be present before or after applying the rule to a certain context. Such a condition influences thus each rule application or transformation and therefore changes significantly the properties of the replacement system. The effect of negative application conditions on parallelism and concurrency in the replacement system is described in the generalization of the following results, formulated already for adhesive HLR systems without negative application conditions: Local Church-Rosser Theorem, Parallelism Theorem and Concurrency Theorem. These important generalized results will support the development of formal analysis techniques for adhesive HLR systems with negative application conditions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reconfigurable Petri Systems with Negative Application Conditions

This thesis introduces negative application conditions (NACs) for varied kinds of reconfigurable Petri systems. These are Petri systems together with a set of transformation rules that allow changing the Petri system dynamically. Negative applications are a control structure for restricting the application of a rule if a certain structute is present. As introduced in [Lam07] and [LEOP08], (weak...

متن کامل

Fundamental Theory for Typed Attributed Graph Transformation

The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no adequate theory for this important branch of graph transformation. In this paper we give a new formalization of typed attributed graphs, which allows node and edge attribution. The first main result shows that the corresp...

متن کامل

Fundamental Theory for Typed Attributed Graph Transformation: Long Version

The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no adequate theory for this important branch of graph transformation. In this paper we give a new formalization of typed attributed graphs, which allows node and edge attribution. The first main result shows that the corresp...

متن کامل

Parallelism and Concurrency Theorems for Rules with Nested Application Conditions

We present Local Church-Rosser, Parallelism, and Concurrency Theorems for rules with nested application conditions in the framework of weak adhesive HLR categories including different kinds of graphs. The proofs of the statements are based on the corresponding statements for rules without application conditions and two Shift-Lemmas, saying that nested application conditions can be shifted over ...

متن کامل

Analysis of permutation equivalence in -adhesive transformation systems with negative application conditions

M-adhesive categories provide an abstract framework for a large variety of specification frameworks for modelling distributed and concurrent systems. They extend the well-known frameworks of adhesive and weak adhesive HLR categories and integrate high-level constructs like attribution as in the case of typed attributed graphs. This article presents M-adhesive transformation systems including ne...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 203  شماره 

صفحات  -

تاریخ انتشار 2008